Header-size lower bounds for end-to-end communication in memoryless networks

Header-Size Lower Bounds for End-to-End Communi ation in Memoryless Networks

Bounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel

In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...

Optimal Transmission of Data Over Multi-Hop Networks

We study the end-to-end delay performance when transmitting data traac over multi-hop networks. Data is normally carried in transmission units (e.g., packet, frame, cell). The performance is strongly aaected by several factors, including header and payload sizes of the transmission units, and the eeect of pipelining these units over the multiple links. We determine the optimal payload size as a...

Reliability Bounds for Delay-Constrained Multi-hop Networks

We consider a linear multi-hop network composed of multi-state discrete-time memoryless channels over each hop, with orthogonal time-sharing across hops under a half-duplex relaying protocol. We analyze the probability of error and associated reliability function [1] over the multi-hop network; with emphasis on random coding and sphere packing bounds, under the assumption of point-to-point codi...

Securing Internet of Things with Lightweight IPsec

Real-world deployments of wireless sensor networks (WSNs) require secure communication. It is important that a receiver is able to verify that sensor data was generated by trusted nodes. In some cases it may also be necessary to encrypt sensor data in transit. Recently, WSNs and traditional IP networks are more tightly integrated using IPv6 and 6LoWPAN. Available IPv6 protocol stacks can use IP...